منابع مشابه
Earthmover Resilience and Testing in Ordered Structures
One of the main challenges in property testing is to characterize those properties that are testable with a constant number of queries. For unordered structures such as graphs and hypergraphs this task has been mostly settled. However, for ordered structures such as strings, images, and ordered graphs, the characterization problem seems very difficult in general. In this paper, we identify a wi...
متن کامل$L_1/\ell_1$-to-$L_1/\ell_1$ analysis of linear positive impulsive systems with application to the $L_1/\ell_1$-to-$L_1/\ell_1$ interval observation of linear impulsive and switched systems
Sufficient conditions characterizing the asymptotic stability and the hybrid L1/`1-gain of linear positive impulsive systems under minimum and range dwell-time constraints are obtained. These conditions are stated as infinite-dimensional linear programming problems that can be solved using sum of squares programming, a relaxation that is known to be asymptotically exact in the present case. The...
متن کاملP-value: What is and what is not
The misinterpretation and misuse of p-value have been increasing for decades. In March 2016, the American Statistical Association released a statement to warn about the use and interpretation of p-value. In this study, we provided a definition and discussion of p-value and emphasized the importance of its accurate interpretation.
متن کاملStroke in MELAS is a Vasogenic Edema and Not Ischemic
We read with interest the article by Almasi et al. on a 48 years old female patient with Mitochondrial Encephalomyopathy, Lactic Acidosis, And Stroke-like episodes (MELAS), diagnosed based on the clinical presentation, blood test results, and imaging and muscle biopsy findings . We have the following comments and concerns.
متن کاملPlanar Graph Coloring is not Self-Reducible, Assuming P != NP
We show that obtaining the lexicographically first four coloring of a planar graph is NP–hard. This shows that planar graph four-coloring is not self-reducible, assuming P 6= NP . One consequence of our result is that the schema of [JVV 86] cannot be used for approximately counting the number of four colorings of a planar graph. These results extend to planar graph k-coloring, for k ≥ 4. Resear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2007
ISSN: 0097-5397,1095-7111
DOI: 10.1137/05064206x